Binary strings without zigzags
نویسندگان
چکیده
We study several enumerative properties of the set of all binary strings without zigzags, i.e., without substrings equal to 101 or 010 . Specifically we give the generating series, a recurrence and two explicit formulas for the number wm,n of these strings with m 1’s and n 0’s and in particular for the numbers wn = wn,n of central strings. We also consider two matrices generated by the numbers wm,n and we prove that one is a Riordan matrix and the other one has a decomposition LTL where L is a lower triangular matrix and T is a tridiagonal matrix, both with integer entries. Finally, we give a combinatorial interpretation of the strings under consideration as binomial lattice paths without zigzags. Then we consider the more general case of Motzkin, Catalan, and trinomial paths without zigzags.
منابع مشابه
Circular Binary Strings without Zigzags
We study several enumerative properties of the set of all circular binary strings without zigzags and of the set of all (0, 1)-necklaces without zigzags, where a zigzag is a 1 followed and preceded by a 0 or a 0 followed and preceded by a 1.
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملBinary Strings Without Odd Runs of Zeros
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of runs, and the number of levels, rises and drops as functions of the Fibonacci and Lucas numbers and also give their generating functions. Furthermore, we look at the decimal value of the sum of all binary strings of le...
متن کاملCounting Palindromic Binary Strings Without r-Runs of Ones
A closed-form expression is derived for the enumeration of all palindromic binary strings of length n > r having no r-runs of 1’s, in terms of the r-Fibonacci sequence. A similar closed-form expression for the number of zeros contained in all such palindromic binary strings is derived in terms of the number of zeros contained in all binary strings having no r-runs of 1’s.
متن کاملEnumerating Binary Strings without r-Runs of Ones
The number of binary strings of length n containing no substrings consisting of r consecutive ones is examined and shown to be given in terms of a well known integer sequence namely, the r-Fibonacci sequence. In addition, difference equations for the number of zeros and the total number of runs within these binary strings are derived. Mathematics Subject Classification: Primary 11B39, Secondary...
متن کامل